import java.util.HashMap;
import java.util.List;
import java.util.Map;
import java.util.TreeMap;

public class Test {


    public static void main6(String[] args) {
        Solution solution = new Solution();
        int ret = solution.firstUniqChar("aabb");
        System.out.println(ret);
    }

    public static void main5(String[] args) {
        Solution solution = new Solution();
        int[] nums1 = {4,9,5};
        int[] nums2 = {9,4,9,8,4};
        int[] ret = solution.intersection(nums1,nums2);
        for (int i = 0; i < ret.length; i++) {
            System.out.print(ret[i]+" ");
        }
    }

    public static void main4(String[] args) {
        String s = "paper";
        String t = "title";
        Map<Character,Character> hashMap = new HashMap<>();
        int len = s.length();
        for(int i = 0; i < len; i++) {
            char ch1 = s.charAt(i);
            char ch2 = t.charAt(i);
            hashMap.put(ch1,ch2);
        }

        System.out.println(hashMap);
    }

    public static void main3(String[] args) {
        String[] words = {"i", "love", "leetcode", "i", "love", "coding"};
        Solution solution = new Solution();
        List<String> ret = solution.topKFrequent(words,3);
        System.out.println(ret);
    }

    public static void main2(String[] args) {
        int[] array = {0,0,1,2,3,3,4,7,7,8};
        Solution solution = new Solution();
        List<Integer> list = solution.findClosestElements(array,3,5);
        System.out.println(list);
    }

    public static void main1(String[] args) {
        Solution solution = new Solution();
        int ret = solution.compareVersion("1.01","1.001");
        System.out.println(ret);
    }

}
